COS 598 D - Lattices scribe : Srdjan Krstic
نویسنده
چکیده
The first two sections are largely based on the first two lectures by Oded Regev, course ”Lattices in Computer Science, Fall 2004. The third part is somewhat based on the paper by Oded Regev and Daniele Micciancio Worst-case to Average-case Reductions based on Gaussian Measures, SIAM Journal on Computing 37(1) pp. 267-302, 2007. and to a larger extent on the paper by O. Goldreich, S. Goldwasser, and S. Halevi Collision-Free Hashing from Lattice Problems, ECCC, TR96-042, 1996.
منابع مشابه
COS 598 E : Unsupervised Learning Rate Distortion and Unsupervised Learning
2 Rate-Distortion Basics 2 2.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Gaussian Source . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2.1 Sphere-Packing Intuition . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Proving Information Rate Distortion = Rate Distortion . . . . . . . . . . . . 4 2.3.1 Convexity of R(...
متن کاملCOS 598 D Lecture 10 Applications of Group Representation
We let ω denote the least exponent such that two n× n matrices can be multiplied with O(nω+ ) arithmetic operations for every > 0. It is clear that ω ≥ 2, while Strassen showed that ω is strictly less than 3. Today it is widely believed that ω = 2, although the best upper bound is roughly 2.34 due Coppersmith and Winograd. We will see a somewhat worse upper bound based on a group theoretic appr...
متن کاملLattices in Computer Science Lecture 8 Dual Lattices Lecturer : Oded Regev Scribe : Gillat Kol
From the above definition, we have the following geometrical interpretation of the dual lattice. For any vector x, the set of all points whose inner product with x is integer forms a set of hyperplanes perpendicular to x and separated by distance 1/‖x‖. Hence, any vector x in a lattice Λ imposes the constraint that all points in Λ∗ lie in one of the hyperplanes defined by x. See the next figure...
متن کاملA characterization of multiwavelet packets on general lattices
The objective of this paper is to establish a complete characterization of multiwavelet packets associated with matrix dilation on general lattices $Gamma$ in $mathbb R^d$ by virtue of time-frequency analysis, matrix theory and operator theory.
متن کاملAn equivalence functor between local vector lattices and vector lattices
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008